Work-Time Optimal K-Merge Algorithms on the PRAM
نویسندگان
چکیده
The k-merge problem, given a collection of k, (2 k n), sorted sequences of total length n, asks to merge them into a new sorted sequence. The main contribution of this work is to propose simple and intuitive work-time optimal algorithms for the k-merge problem on two PRAM models. Specifically, our k-merge algorithms perform O(n log k) work and run in O(logn) time on the EREW-PRAM and in O(log logn+log k) time on the CREW-PRAM, respectively.
منابع مشابه
Investigating the Practical Value of Cole s O log n time CREW PRAM Merge Sort Algorithm
The work reported in this paper is motivated by a wish to learn more about the practical value of parallel algorithms taken from the eld of theoretical computer science The literature on parallel complexity theory contains a large and rapidly increasing amount of parallel algorithms Most of these algorithms are described for the PRAM model a computa tional model originally presented by Fortune ...
متن کاملEfficient Low-Contention Parallel Algorithms
The queue-read queue-write asyn-chronous PRAM model. Parallel algorithms for shared-memory machines. The design and analysis of a new hybrid sorting algorithm. A new universal class of hash functions and dynamic hashing in real time. NYU Ultracomputer { designing an MIMD shared memory parallel computer. In this paper we have presented highly parallel work-optimal algorithms for several fundamen...
متن کاملEvaluating Parallel Algorithms Theoretical and Practical Aspects
The motivation for the work reported in this thesis has been to lessen the gap between theory and practice within the eld of parallel computing When looking for new and faster parallel algorithms for use in massively parallel systems it is tempting to investigate promising alternatives from the large body of research done on parallel algorithms within the eld of theoretical computer science The...
متن کاملThe Queue-Read Queue-Write Asynchronous PRAM Model
This paper presents results for the queue-read, queue-write asynchronous parallel random access machine (qrqw asynchronous pram) model, which is the asynchronous variant of the qrqw pram model. The qrqw pram family of models, which was introduced earlier by the authors, permit concurrent reading and writing to shared memory locations, but each memory location is viewed as having a queue which c...
متن کاملThe Queue - Read Queue - WriteAsynchronous PRAM
This paper presents results for the queue-read, queue-write asynchronous parallel random access machine (qrqw asynchronous pram) model, which is the asynchronous variant of the qrqw pram model. The qrqw pram family of models, which was introduced earlier by the authors, permit concurrent reading and writing to shared memory locations, but each memory location is viewed as having a queue which c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997